An approximative inference method for solving ∃∀SO satisfiability problems
نویسندگان
چکیده
منابع مشابه
An approximative inference method for solving ∃∀SO satisfiability problems
This paper considers the fragment ∃∀SO of second-order logic. Many interesting problems, such as conformant planning, can be naturally expressed as finite domain satisfiability problems of this logic. Such satisfiability problems are computationally hard (Σ2 ) and many of these problems are often solved approximately. In this paper, we develop a general approximative method, i.e., a sound but i...
متن کاملAn efficient approach for solving layout problems
This paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. By this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. This is resulted from dividing area into discrete and continuous dimensions. Also defining decision var...
متن کاملOn Some Problems in Satisfiability Solving
Satisfiability solving is the problem of determining whether a given formula has a solution. The most ubiquitous and well-studied satisfiability problem is propositional satisfiability (SAT), in which all variables are Boolean. In recent years, the field of satisfiability modulo theories (SMT) has extended methods in SAT solving to accommodate existential first order formulas with non-Boolean v...
متن کاملSolving Random Satisfiability Problems with Quantum Computers
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approximate asymptotic analysis accounting for both the average and variation of amplitudes among search states with the same costs. The analysis predicts good performance, on average, for a variety of problems including th...
متن کاملSolving edge-matching problems with satisfiability solvers
Programs that solve Boolean satisfiability (SAT) problems have become powerful tools to tackle a wide range of applications. The usefulness of these solvers does not only depend on their strength and the properties of a certain problem, but also on how the problem is translated into SAT. This paper offers additional evidence for this claim. To show the impact of the translation on the performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2012
ISSN: 1076-9757
DOI: 10.1613/jair.3658